Base | Representation |
---|---|
bin | 10111001100111000010001… |
… | …001110011101000010100001 |
3 | 111101021221101112211011201120 |
4 | 113030320101032131002201 |
5 | 101333311132214120001 |
6 | 1001004330201522453 |
7 | 30331104230164464 |
oct | 2714702116350241 |
9 | 441257345734646 |
10 | 102040122020001 |
11 | 2a570a77777480 |
12 | b5400864a3429 |
13 | 44c245ab13049 |
14 | 1b2aaa81532db |
15 | bbe46ed38236 |
hex | 5cce1139d0a1 |
102040122020001 has 16 divisors (see below), whose sum is σ = 149242006699968. Its totient is φ = 61500826929600.
The previous prime is 102040122019963. The next prime is 102040122020029. The reversal of 102040122020001 is 100020221040201.
It is not a de Polignac number, because 102040122020001 - 26 = 102040122019937 is a prime.
It is a super-3 number, since 3×1020401220200013 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (102040122020051) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8541775546 + ... + 8541787491.
It is an arithmetic number, because the mean of its divisors is an integer number (9327625418748).
Almost surely, 2102040122020001 is an apocalyptic number.
102040122020001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
102040122020001 is a deficient number, since it is larger than the sum of its proper divisors (47201884679967).
102040122020001 is a wasteful number, since it uses less digits than its factorization.
102040122020001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17083563232.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 102040122020001 its reverse (100020221040201), we get a palindrome (202060343060202).
The spelling of 102040122020001 in words is "one hundred two trillion, forty billion, one hundred twenty-two million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •