Base | Representation |
---|---|
bin | 10111000010111001011111… |
… | …000011100010011110001000 |
3 | 111021212100222202122112220122 |
4 | 113002321133003202132020 |
5 | 101241041432122423102 |
6 | 555321254124042412 |
7 | 30230413243631546 |
oct | 2702713703423610 |
9 | 437770882575818 |
10 | 101354233014152 |
11 | 2a3270a8267618 |
12 | b44b167693408 |
13 | 4472880c779b1 |
14 | 1b057dcd78d96 |
15 | bab6c99db0a2 |
hex | 5c2e5f0e2788 |
101354233014152 has 32 divisors (see below), whose sum is σ = 198574527715200. Its totient is φ = 48407087122944.
The previous prime is 101354233014103. The next prime is 101354233014239. The reversal of 101354233014152 is 251410332453101.
It is a super-2 number, since 2×1013542330141522 (a number of 29 digits) contains 22 as substring.
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 7 ways as a sum of consecutive naturals, for example, 378709577 + ... + 378977112.
It is an arithmetic number, because the mean of its divisors is an integer number (6205453991100).
Almost surely, 2101354233014152 is an apocalyptic number.
It is an amenable number.
101354233014152 is a deficient number, since it is larger than the sum of its proper divisors (97220294701048).
101354233014152 is a wasteful number, since it uses less digits than its factorization.
101354233014152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 757687445 (or 757687441 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 35.
Adding to 101354233014152 its reverse (251410332453101), we get a palindrome (352764565467253).
The spelling of 101354233014152 in words is "one hundred one trillion, three hundred fifty-four billion, two hundred thirty-three million, fourteen thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •