Base | Representation |
---|---|
bin | 10111000011101111010011… |
… | …000001100100110100101010 |
3 | 111022001220010120022201011221 |
4 | 113003233103001210310222 |
5 | 101243013300341401102 |
6 | 555404011414412254 |
7 | 30234530140444456 |
oct | 2703572301446452 |
9 | 438056116281157 |
10 | 101412013231402 |
11 | 2a349658732a85 |
12 | b45a3b206108a |
13 | 447815b867c63 |
14 | 1b08520ac1666 |
15 | bace5c415637 |
hex | 5c3bd3064d2a |
101412013231402 has 32 divisors (see below), whose sum is σ = 153803342926800. Its totient is φ = 50147956846080.
The previous prime is 101412013231369. The next prime is 101412013231411. The reversal of 101412013231402 is 204132310214101.
101412013231402 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 58582200517801 + 42829812713601 = 7653901^2 + 6544449^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 53920974 + ... + 55770022.
Almost surely, 2101412013231402 is an apocalyptic number.
101412013231402 is a deficient number, since it is larger than the sum of its proper divisors (52391329695398).
101412013231402 is a wasteful number, since it uses less digits than its factorization.
101412013231402 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1850058.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 101412013231402 its reverse (204132310214101), we get a palindrome (305544323445503).
The spelling of 101412013231402 in words is "one hundred one trillion, four hundred twelve billion, thirteen million, two hundred thirty-one thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •