Base | Representation |
---|---|
bin | 11101011001011101110… |
… | …10001100110101101000 |
3 | 10120120020220111020110020 |
4 | 32230232322030311220 |
5 | 113022143201322212 |
6 | 2052011401120440 |
7 | 132656220040641 |
oct | 16545672146550 |
9 | 3516226436406 |
10 | 1010104323432 |
11 | 35a423614716 |
12 | 143921a89120 |
13 | 74338781649 |
14 | 36c643a46c8 |
15 | 1b41d87ed8c |
hex | eb2ee8cd68 |
1010104323432 has 32 divisors (see below), whose sum is σ = 2525832012480. Its totient is φ = 336625280640.
The previous prime is 1010104323407. The next prime is 1010104323439. The reversal of 1010104323432 is 2343234010101.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (1010104323439) 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, 4651669 + ... + 4863972.
It is an arithmetic number, because the mean of its divisors is an integer number (78932250390).
Almost surely, 21010104323432 is an apocalyptic number.
1010104323432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1010104323432 is an abundant number, since it is smaller than the sum of its proper divisors (1515727689048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010104323432 is a wasteful number, since it uses less digits than its factorization.
1010104323432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9520073 (or 9520069 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 1010104323432 its reverse (2343234010101), we get a palindrome (3353338333533).
The spelling of 1010104323432 in words is "one trillion, ten billion, one hundred four million, three hundred twenty-three thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •