Base | Representation |
---|---|
bin | 1001000111010001000001… |
… | …1011011100101010010111 |
3 | 1022110221111022000220000000 |
4 | 2101310100123130222113 |
5 | 2303133322142113221 |
6 | 33151153551422343 |
7 | 2052644463324204 |
oct | 221642033345227 |
9 | 38427438026000 |
10 | 10020434332311 |
11 | 3213707a48367 |
12 | 115a03b2249b3 |
13 | 578bcc805610 |
14 | 268dc4d94cab |
15 | 1259c3da4e26 |
hex | 91d106dca97 |
10020434332311 has 32 divisors (see below), whose sum is σ = 16184388373440. Its totient is φ = 6166421110080.
The previous prime is 10020434332309. The next prime is 10020434332333. The reversal of 10020434332311 is 11323343402001.
It is a happy number.
10020434332311 is a `hidden beast` number, since 1 + 0 + 0 + 2 + 0 + 4 + 343 + 3 + 2 + 311 = 666.
It is not a de Polignac number, because 10020434332311 - 21 = 10020434332309 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10020434432311) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 176195310 + ... + 176252171.
It is an arithmetic number, because the mean of its divisors is an integer number (505762136670).
Almost surely, 210020434332311 is an apocalyptic number.
10020434332311 is a deficient number, since it is larger than the sum of its proper divisors (6163954041129).
10020434332311 is an frugal number, since it uses more digits than its factorization.
10020434332311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 352447515 (or 352447497 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 10020434332311 its reverse (11323343402001), we get a palindrome (21343777734312).
The spelling of 10020434332311 in words is "ten trillion, twenty billion, four hundred thirty-four million, three hundred thirty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •