Base | Representation |
---|---|
bin | 1001001110001110100100… |
… | …1101011111001001001001 |
3 | 1022220101012111121221102020 |
4 | 2103203221031133021021 |
5 | 2312113243033222241 |
6 | 33322133514355053 |
7 | 2064410350111605 |
oct | 223435115371111 |
9 | 38811174557366 |
10 | 10140035445321 |
11 | 325a401727811 |
12 | 117925942ba89 |
13 | 58728017ab82 |
14 | 270acd346505 |
15 | 128b73d16b66 |
hex | 938e935f249 |
10140035445321 has 8 divisors (see below), whose sum is σ = 13956177817344. Its totient is φ = 6541958351760.
The previous prime is 10140035445299. The next prime is 10140035445347. The reversal of 10140035445321 is 12354453004101.
10140035445321 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10140035445321 - 27 = 10140035445193 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10140035445361) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 54516319506 + ... + 54516319691.
It is an arithmetic number, because the mean of its divisors is an integer number (1744522227168).
Almost surely, 210140035445321 is an apocalyptic number.
It is an amenable number.
10140035445321 is a deficient number, since it is larger than the sum of its proper divisors (3816142372023).
10140035445321 is a wasteful number, since it uses less digits than its factorization.
10140035445321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 109032639231.
The product of its (nonzero) digits is 28800, while the sum is 33.
Adding to 10140035445321 its reverse (12354453004101), we get a palindrome (22494488449422).
The spelling of 10140035445321 in words is "ten trillion, one hundred forty billion, thirty-five million, four hundred forty-five thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •