Base | Representation |
---|---|
bin | 1001010001111100111011… |
… | …0000111010000000100100 |
3 | 1100010111100102210211110102 |
4 | 2110133032300322000210 |
5 | 2314140311130130022 |
6 | 33411354345243232 |
7 | 2102134015035506 |
oct | 224371660720044 |
9 | 40114312724412 |
10 | 10204016255012 |
11 | 3284554181038 |
12 | 1189734493518 |
13 | 59030856aa48 |
14 | 273c3c795d76 |
15 | 12a66ac9da92 |
hex | 947cec3a024 |
10204016255012 has 6 divisors (see below), whose sum is σ = 17857028446278. Its totient is φ = 5102008127504.
The previous prime is 10204016254961. The next prime is 10204016255063. The reversal of 10204016255012 is 21055261040201.
It is an interprime number because it is at equal distance from previous prime (10204016254961) and next prime (10204016255063).
It can be written as a sum of positive squares in only one way, i.e., 5633245914916 + 4570770340096 = 2373446^2 + 2137936^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1275502031873 + ... + 1275502031880.
It is an arithmetic number, because the mean of its divisors is an integer number (2976171407713).
Almost surely, 210204016255012 is an apocalyptic number.
It is an amenable number.
10204016255012 is a deficient number, since it is larger than the sum of its proper divisors (7653012191266).
10204016255012 is a wasteful number, since it uses less digits than its factorization.
10204016255012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2551004063757 (or 2551004063755 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 29.
Adding to 10204016255012 its reverse (21055261040201), we get a palindrome (31259277295213).
The spelling of 10204016255012 in words is "ten trillion, two hundred four billion, sixteen million, two hundred fifty-five thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •