Base | Representation |
---|---|
bin | 1001101011101000101000… |
… | …0111101100001111000101 |
3 | 1101200200020111212000111012 |
4 | 2122322022013230033011 |
5 | 2343402431013401433 |
6 | 34350205243052005 |
7 | 2146044060665546 |
oct | 232721207541705 |
9 | 41620214760435 |
10 | 10645246231493 |
11 | 3434694a81a65 |
12 | 123b153511005 |
13 | 5c2ac4a1a173 |
14 | 28b33861a4cd |
15 | 136d9213b848 |
hex | 9ae8a1ec3c5 |
10645246231493 has 16 divisors (see below), whose sum is σ = 11455913306880. Its totient is φ = 9860917120704.
The previous prime is 10645246231457. The next prime is 10645246231513. The reversal of 10645246231493 is 39413264254601.
10645246231493 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10645246231493 - 210 = 10645246230469 is a prime.
It is a super-2 number, since 2×106452462314932 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10645246831493) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17744621 + ... + 18334722.
It is an arithmetic number, because the mean of its divisors is an integer number (715994581680).
Almost surely, 210645246231493 is an apocalyptic number.
It is an amenable number.
10645246231493 is a deficient number, since it is larger than the sum of its proper divisors (810667075387).
10645246231493 is a wasteful number, since it uses less digits than its factorization.
10645246231493 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36079708.
The product of its (nonzero) digits is 3732480, while the sum is 50.
The spelling of 10645246231493 in words is "ten trillion, six hundred forty-five billion, two hundred forty-six million, two hundred thirty-one thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •