Base | Representation |
---|---|
bin | 10011001110010011101… |
… | …010000010010011101000 |
3 | 11200021211000012110000002 |
4 | 103032103222002103220 |
5 | 133120433222330440 |
6 | 2450512425202132 |
7 | 164304260453501 |
oct | 23162352022350 |
9 | 4607730173002 |
10 | 1321032230120 |
11 | 46a279288a59 |
12 | 194037030348 |
13 | 9775a5b5315 |
14 | 47d1c9abba8 |
15 | 2456a5dc115 |
hex | 13393a824e8 |
1321032230120 has 32 divisors (see below), whose sum is σ = 2973763480320. Its totient is φ = 528156720960.
The previous prime is 1321032230081. The next prime is 1321032230149. The reversal of 1321032230120 is 210322301231.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 1321032230092 and 1321032230101.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7921796 + ... + 8086835.
It is an arithmetic number, because the mean of its divisors is an integer number (92930108760).
Almost surely, 21321032230120 is an apocalyptic number.
1321032230120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1321032230120 is an abundant number, since it is smaller than the sum of its proper divisors (1652731250200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1321032230120 is a wasteful number, since it uses less digits than its factorization.
1321032230120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16010705 (or 16010701 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 1321032230120 its reverse (210322301231), we get a palindrome (1531354531351).
The spelling of 1321032230120 in words is "one trillion, three hundred twenty-one billion, thirty-two million, two hundred thirty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •