Base | Representation |
---|---|
bin | 1011111010101001001000… |
… | …1001110100101010000000 |
3 | 1201101112211000222211202202 |
4 | 2332222102021310222000 |
5 | 3204131101142120222 |
6 | 43511004523132332 |
7 | 2521411211010263 |
oct | 276522211645200 |
9 | 51345730884682 |
10 | 13102102301312 |
11 | 41a16301a59a2 |
12 | 15773376740a8 |
13 | 7406a4bb031b |
14 | 334206370cda |
15 | 17ac38240892 |
hex | bea92274a80 |
13102102301312 has 48 divisors (see below), whose sum is σ = 27547930089450. Its totient is φ = 6206258962944.
The previous prime is 13102102301303. The next prime is 13102102301341. The reversal of 13102102301312 is 21310320120131.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 12701696835136 + 400405466176 = 3563944^2 + 632776^2 .
It is a super-3 number, since 3×131021023013123 (a number of 40 digits) contains 333 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 141726887 + ... + 141819302.
Almost surely, 213102102301312 is an apocalyptic number.
It is an amenable number.
13102102301312 is an abundant number, since it is smaller than the sum of its proper divisors (14445827788138).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13102102301312 is an equidigital number, since it uses as much as digits as its factorization.
13102102301312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 283546241 (or 283546210 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 13102102301312 its reverse (21310320120131), we get a palindrome (34412422421443).
The spelling of 13102102301312 in words is "thirteen trillion, one hundred two billion, one hundred two million, three hundred one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.889 sec. • engine limits •