Base | Representation |
---|---|
bin | 101101110001010110000001… |
… | …110111100001011110011010 |
3 | 222101202101020020220201111200 |
4 | 231301112001313201132122 |
5 | 202341122021224341442 |
6 | 1552045153315135030 |
7 | 60254443011215532 |
oct | 5561260167413632 |
9 | 871671206821450 |
10 | 201303001012122 |
11 | 5916113a127349 |
12 | 1a6b1a538a4476 |
13 | 8842a3a033429 |
14 | 379d18d99a4c2 |
15 | 18415466a834c |
hex | b71581de179a |
201303001012122 has 384 divisors, whose sum is σ = 468926690918400. Its totient is φ = 62341126848000.
The previous prime is 201303001012111. The next prime is 201303001012231. The reversal of 201303001012122 is 221210100303102.
201303001012122 is a `hidden beast` number, since 20 + 1 + 30 + 300 + 101 + 212 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 201303001012095 and 201303001012104.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 32110860004 + ... + 32110866272.
It is an arithmetic number, because the mean of its divisors is an integer number (1221163257600).
Almost surely, 2201303001012122 is an apocalyptic number.
201303001012122 is an abundant number, since it is smaller than the sum of its proper divisors (267623689906278).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201303001012122 is a wasteful number, since it uses less digits than its factorization.
201303001012122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6642 (or 6639 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 201303001012122 its reverse (221210100303102), we get a palindrome (422513101315224).
The spelling of 201303001012122 in words is "two hundred one trillion, three hundred three billion, one million, twelve thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •