Base | Representation |
---|---|
bin | 101011110011011001111… |
… | …111100000101101011001 |
3 | 101122202200102221202100012 |
4 | 223303121333200231121 |
5 | 343304223402141441 |
6 | 10222500415051305 |
7 | 430321636224104 |
oct | 53633177405531 |
9 | 11582612852305 |
10 | 3010134412121 |
11 | a60655446591 |
12 | 407473b10b35 |
13 | 18ab1531c175 |
14 | a5996c4773b |
15 | 534793029eb |
hex | 2bcd9fe0b59 |
3010134412121 has 4 divisors (see below), whose sum is σ = 3113932150500. Its totient is φ = 2906336673744.
The previous prime is 3010134412079. The next prime is 3010134412123. The reversal of 3010134412121 is 1212144310103.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1322122826896 + 1688011585225 = 1149836^2 + 1299235^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3010134412121 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3010134412123) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 51898869146 + ... + 51898869203.
It is an arithmetic number, because the mean of its divisors is an integer number (778483037625).
Almost surely, 23010134412121 is an apocalyptic number.
It is an amenable number.
3010134412121 is a deficient number, since it is larger than the sum of its proper divisors (103797738379).
3010134412121 is a wasteful number, since it uses less digits than its factorization.
3010134412121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103797738378.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 3010134412121 its reverse (1212144310103), we get a palindrome (4222278722224).
The spelling of 3010134412121 in words is "three trillion, ten billion, one hundred thirty-four million, four hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •