Base | Representation |
---|---|
bin | 1010100110001000000101… |
… | …1100100010110110100001 |
3 | 1112020202000002212111211202 |
4 | 2221202001130202312201 |
5 | 3011333423000103101 |
6 | 40435554224450545 |
7 | 2311456624011533 |
oct | 251420134426641 |
9 | 45222002774752 |
10 | 11650123050401 |
11 | 3791875820100 |
12 | 1381a56779a55 |
13 | 6667a9475764 |
14 | 2c3c2461b853 |
15 | 1530a6ac636b |
hex | a9881722da1 |
11650123050401 has 12 divisors (see below), whose sum is σ = 12805643145876. Its totient is φ = 10590908481120.
The previous prime is 11650123050389. The next prime is 11650123050403. The reversal of 11650123050401 is 10405032105611.
It can be written as a sum of positive squares in 2 ways, for example, as 6428258230801 + 5221864819600 = 2535401^2 + 2285140^2 .
It is not a de Polignac number, because 11650123050401 - 222 = 11650118856097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11650123050403) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12238115 + ... + 13155671.
It is an arithmetic number, because the mean of its divisors is an integer number (1067136928823).
Almost surely, 211650123050401 is an apocalyptic number.
11650123050401 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11650123050401 is a deficient number, since it is larger than the sum of its proper divisors (1155520095475).
11650123050401 is a wasteful number, since it uses less digits than its factorization.
11650123050401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1022512 (or 1022501 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 29.
The spelling of 11650123050401 in words is "eleven trillion, six hundred fifty billion, one hundred twenty-three million, fifty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •