Base | Representation |
---|---|
bin | 101111100100011010… |
… | …1111111101010011001 |
3 | 100202200021111000200121 |
4 | 1133020311333222121 |
5 | 3133202341023101 |
6 | 114532343233241 |
7 | 10244316234106 |
oct | 1371065775231 |
9 | 322607430617 |
10 | 102153845401 |
11 | 3a361201023 |
12 | 1796b148821 |
13 | 982cb0108a |
14 | 4d31125aad |
15 | 29cd38b0a1 |
hex | 17c8d7fa99 |
102153845401 has 12 divisors (see below), whose sum is σ = 107849860500. Its totient is φ = 96744544128.
The previous prime is 102153845347. The next prime is 102153845407. The reversal of 102153845401 is 104548351201.
It can be written as a sum of positive squares in 2 ways, for example, as 50299724176 + 51854121225 = 224276^2 + 227715^2 .
It is not a de Polignac number, because 102153845401 - 223 = 102145456793 is a prime.
It is a super-2 number, since 2×1021538454012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102153845407) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 1054285 + ... + 1147093.
It is an arithmetic number, because the mean of its divisors is an integer number (8987488375).
Almost surely, 2102153845401 is an apocalyptic number.
It is an amenable number.
102153845401 is a deficient number, since it is larger than the sum of its proper divisors (5696015099).
102153845401 is an equidigital number, since it uses as much as digits as its factorization.
102153845401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95896 (or 95877 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 34.
The spelling of 102153845401 in words is "one hundred two billion, one hundred fifty-three million, eight hundred forty-five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •