Base | Representation |
---|---|
bin | 10111001100110001101001… |
… | …011001100110100100000011 |
3 | 111101021021000222221101221202 |
4 | 113030301221121212210003 |
5 | 101333202101404344021 |
6 | 1001001152432411415 |
7 | 30330433066013633 |
oct | 2714615131464403 |
9 | 441237028841852 |
10 | 102033011403011 |
11 | 2a568a58a3a707 |
12 | b53a8210a6b6b |
13 | 44c1896919c80 |
14 | 1b2a5d1a406c3 |
15 | bbe1a596da0b |
hex | 5ccc69666903 |
102033011403011 has 8 divisors (see below), whose sum is σ = 109891385101344. Its totient is φ = 94176020635200.
The previous prime is 102033011402983. The next prime is 102033011403023. The reversal of 102033011403011 is 110304110330201.
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 102033011403011 - 230 = 102031937661187 is a prime.
It is a super-2 number, since 2×1020330114030112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102033011403031) 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, 345579386 + ... + 345874511.
It is an arithmetic number, because the mean of its divisors is an integer number (13736423137668).
Almost surely, 2102033011403011 is an apocalyptic number.
102033011403011 is a deficient number, since it is larger than the sum of its proper divisors (7858373698333).
102033011403011 is a wasteful number, since it uses less digits than its factorization.
102033011403011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 691465261.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 102033011403011 its reverse (110304110330201), we get a palindrome (212337121733212).
The spelling of 102033011403011 in words is "one hundred two trillion, thirty-three billion, eleven million, four hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •