Base | Representation |
---|---|
bin | 11110000010011111100… |
… | …11010110011000000110 |
3 | 10122200002222120221220022 |
4 | 33001033303112120012 |
5 | 113402301014341402 |
6 | 2110053205335142 |
7 | 134366111564111 |
oct | 17011763263006 |
9 | 3580088527808 |
10 | 1032131012102 |
11 | 3687a7059953 |
12 | 14804a7074b2 |
13 | 76438cb9338 |
14 | 37d538d1578 |
15 | 1bcac4d12a2 |
hex | f04fcd6606 |
1032131012102 has 8 divisors (see below), whose sum is σ = 1548418949112. Its totient is φ = 515991362400.
The previous prime is 1032131012063. The next prime is 1032131012141. The reversal of 1032131012102 is 2012101312301.
1032131012102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (1032131012063) and next prime (1032131012141).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×10321310121022 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 37054424 + ... + 37082267.
It is an arithmetic number, because the mean of its divisors is an integer number (193552368639).
Almost surely, 21032131012102 is an apocalyptic number.
1032131012102 is a deficient number, since it is larger than the sum of its proper divisors (516287937010).
1032131012102 is an equidigital number, since it uses as much as digits as its factorization.
1032131012102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 74143654.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1032131012102 its reverse (2012101312301), we get a palindrome (3044232324403).
The spelling of 1032131012102 in words is "one trillion, thirty-two billion, one hundred thirty-one million, twelve thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •