Base | Representation |
---|---|
bin | 11011111110000100111110… |
… | …010001001011010101011111 |
3 | 121010112221120121211222002101 |
4 | 123332010332101023111133 |
5 | 112110422014432440012 |
6 | 1113343252454505531 |
7 | 34624260563211334 |
oct | 3376047621132537 |
9 | 533487517758071 |
10 | 123013203015007 |
11 | 36217674177538 |
12 | 119689489652a7 |
13 | 53841313ccc96 |
14 | 2253c2965a98b |
15 | e34cc804dd57 |
hex | 6fe13e44b55f |
123013203015007 has 8 divisors (see below), whose sum is σ = 129500791292160. Its totient is φ = 116526935655000.
The previous prime is 123013203014987. The next prime is 123013203015011. The reversal of 123013203015007 is 700510302310321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 123013203015007 - 27 = 123013203014879 is a prime.
It is a super-2 number, since 2×1230132030150072 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123013203015077) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 330038119 + ... + 330410632.
It is an arithmetic number, because the mean of its divisors is an integer number (16187598911520).
Almost surely, 2123013203015007 is an apocalyptic number.
123013203015007 is a deficient number, since it is larger than the sum of its proper divisors (6487588277153).
123013203015007 is an equidigital number, since it uses as much as digits as its factorization.
123013203015007 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 660458573.
The product of its (nonzero) digits is 3780, while the sum is 28.
Adding to 123013203015007 its reverse (700510302310321), we get a palindrome (823523505325328).
The spelling of 123013203015007 in words is "one hundred twenty-three trillion, thirteen billion, two hundred three million, fifteen thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •