Base | Representation |
---|---|
bin | 10111011011010100111110… |
… | …100100001000011110000101 |
3 | 111111210212020022202212000211 |
4 | 113123110332210020132011 |
5 | 102001043111122414023 |
6 | 1003044414354035421 |
7 | 30462614200621501 |
oct | 2733247644103605 |
9 | 444725208685024 |
10 | 103033020123013 |
11 | 2a914070881012 |
12 | b6805a5b78b71 |
13 | 4564c83949876 |
14 | 1b62b792b7301 |
15 | bda1d2d58a0d |
hex | 5db53e908785 |
103033020123013 has 8 divisors (see below), whose sum is σ = 109342291227840. Its totient is φ = 96751360708800.
The previous prime is 103033020122993. The next prime is 103033020123097. The reversal of 103033020123013 is 310321020330301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103033020123013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103033020123613) 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, 6902914963 + ... + 6902929888.
It is an arithmetic number, because the mean of its divisors is an integer number (13667786403480).
Almost surely, 2103033020123013 is an apocalyptic number.
It is an amenable number.
103033020123013 is a deficient number, since it is larger than the sum of its proper divisors (6309271104827).
103033020123013 is a wasteful number, since it uses less digits than its factorization.
103033020123013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13805845307.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 103033020123013 its reverse (310321020330301), we get a palindrome (413354040453314).
The spelling of 103033020123013 in words is "one hundred three trillion, thirty-three billion, twenty million, one hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.443 sec. • engine limits •