Base | Representation |
---|---|
bin | 10111001100011101100011… |
… | …001100011001001001110010 |
3 | 111101012012100010022112020120 |
4 | 113030131203030121021302 |
5 | 101332323403201043214 |
6 | 1000543223300351110 |
7 | 30326040251606406 |
oct | 2714354314311162 |
9 | 441165303275216 |
10 | 102011432440434 |
11 | 2a55a8951a8740 |
12 | b5365ba3a5496 |
13 | 44bc838093c6a |
14 | 1b29545b7d106 |
15 | bbd8412abea9 |
hex | 5cc763319272 |
102011432440434 has 32 divisors (see below), whose sum is σ = 223281485630784. Its totient is φ = 30813793121280.
The previous prime is 102011432440391. The next prime is 102011432440453. The reversal of 102011432440434 is 434044234110201.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 102011432440395 and 102011432440404.
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, 2469033279 + ... + 2469074594.
It is an arithmetic number, because the mean of its divisors is an integer number (6977546425962).
Almost surely, 2102011432440434 is an apocalyptic number.
102011432440434 is an abundant number, since it is smaller than the sum of its proper divisors (121270053190350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102011432440434 is a wasteful number, since it uses less digits than its factorization.
102011432440434 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4938108202.
The product of its (nonzero) digits is 36864, while the sum is 33.
Adding to 102011432440434 its reverse (434044234110201), we get a palindrome (536055666550635).
The spelling of 102011432440434 in words is "one hundred two trillion, eleven billion, four hundred thirty-two million, four hundred forty thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •