Base | Representation |
---|---|
bin | 10001110000010011101… |
… | …000001011011111100001 |
3 | 11022122021212102111220101 |
4 | 101300103220023133201 |
5 | 124442231100341001 |
6 | 2332301201342401 |
7 | 154102133662063 |
oct | 21602350133741 |
9 | 4278255374811 |
10 | 1220100012001 |
11 | 430494715662 |
12 | 178569037a01 |
13 | 8b09390b730 |
14 | 430a5c05733 |
15 | 21b0e60ea01 |
hex | 11c13a0b7e1 |
1220100012001 has 16 divisors (see below), whose sum is σ = 1336198259088. Its totient is φ = 1107199008000.
The previous prime is 1220100011953. The next prime is 1220100012041. The reversal of 1220100012001 is 1002100010221.
It can be written as a sum of positive squares in 8 ways, for example, as 175209216400 + 1044890795601 = 418580^2 + 1022199^2 .
It is a cyclic number.
It is not a de Polignac number, because 1220100012001 - 29 = 1220100011489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1220100012041) by changing a digit.
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 in 15 ways as a sum of consecutive naturals, for example, 1102815 + ... + 1912171.
It is an arithmetic number, because the mean of its divisors is an integer number (83512391193).
Almost surely, 21220100012001 is an apocalyptic number.
It is an amenable number.
1220100012001 is a deficient number, since it is larger than the sum of its proper divisors (116098247087).
1220100012001 is a wasteful number, since it uses less digits than its factorization.
1220100012001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 811332.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 1220100012001 its reverse (1002100010221), we get a palindrome (2222200022222).
The spelling of 1220100012001 in words is "one trillion, two hundred twenty billion, one hundred million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •