Base | Representation |
---|---|
bin | 10001011110101101001… |
… | …011011001000100010110 |
3 | 11020211111210012111111201 |
4 | 101132231023121010112 |
5 | 124140030014221324 |
6 | 2315454013023114 |
7 | 152532613520230 |
oct | 21365513310426 |
9 | 4224453174451 |
10 | 1201201320214 |
11 | 423476914815 |
12 | 174973a84a9a |
13 | 8937145207c |
14 | 421d1cbd250 |
15 | 213a53d7444 |
hex | 117ad2d9116 |
1201201320214 has 16 divisors (see below), whose sum is σ = 2059686541728. Its totient is φ = 514679496192.
The previous prime is 1201201320199. The next prime is 1201201320217. The reversal of 1201201320214 is 4120231021021.
It is a super-3 number, since 3×12012013202143 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 1201201320191 and 1201201320200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201201320217) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10027467 + ... + 10146550.
It is an arithmetic number, because the mean of its divisors is an integer number (128730408858).
Almost surely, 21201201320214 is an apocalyptic number.
1201201320214 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
1201201320214 is a deficient number, since it is larger than the sum of its proper divisors (858485221514).
1201201320214 is a wasteful number, since it uses less digits than its factorization.
1201201320214 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20178279.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 1201201320214 its reverse (4120231021021), we get a palindrome (5321432341235).
The spelling of 1201201320214 in words is "one trillion, two hundred one billion, two hundred one million, three hundred twenty thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •