Base | Representation |
---|---|
bin | 11011100100000000111110… |
… | …110001000001010010000001 |
3 | 120220012201201020112001020112 |
4 | 123210000332301001102001 |
5 | 111342101041230000001 |
6 | 1105452414154521105 |
7 | 34351005240602615 |
oct | 3344007661012201 |
9 | 526181636461215 |
10 | 121222210000001 |
11 | 3569706131a000 |
12 | 11719814a36195 |
13 | 52842892124c6 |
14 | 21d12871a1345 |
15 | e03404101cbb |
hex | 6e403ec41481 |
121222210000001 has 32 divisors (see below), whose sum is σ = 133762499020800. Its totient is φ = 109849305984000.
The previous prime is 121222209999937. The next prime is 121222210000037. The reversal of 121222210000001 is 100000012222121.
It is not a de Polignac number, because 121222210000001 - 26 = 121222209999937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121222210002001) 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, 828859040 + ... + 829005278.
It is an arithmetic number, because the mean of its divisors is an integer number (4180078094400).
Almost surely, 2121222210000001 is an apocalyptic number.
121222210000001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
121222210000001 is a deficient number, since it is larger than the sum of its proper divisors (12540289020799).
121222210000001 is a wasteful number, since it uses less digits than its factorization.
121222210000001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 148262 (or 148240 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 121222210000001 its reverse (100000012222121), we get a palindrome (221222222222122).
The spelling of 121222210000001 in words is "one hundred twenty-one trillion, two hundred twenty-two billion, two hundred ten million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •