Base | Representation |
---|---|
bin | 1001011110101101011111… |
… | …1011010110110001011111 |
3 | 1100220110010122202112020100 |
4 | 2113223113323112301133 |
5 | 2331233220102240221 |
6 | 34100205203152143 |
7 | 2124023641254030 |
oct | 227532773266137 |
9 | 40813118675210 |
10 | 10423213321311 |
11 | 335950720728a |
12 | 1204109075653 |
13 | 5a7b9bac553b |
14 | 2806b426ca87 |
15 | 1311e9737926 |
hex | 97ad7ed6c5f |
10423213321311 has 12 divisors (see below), whose sum is σ = 17206574371792. Its totient is φ = 5956121897856.
The previous prime is 10423213321247. The next prime is 10423213321331. The reversal of 10423213321311 is 11312331232401.
10423213321311 is a `hidden beast` number, since 1 + 0 + 4 + 2 + 3 + 21 + 3 + 321 + 311 = 666.
It is not a de Polignac number, because 10423213321311 - 26 = 10423213321247 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10423213321331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 82723915186 + ... + 82723915311.
Almost surely, 210423213321311 is an apocalyptic number.
10423213321311 is a deficient number, since it is larger than the sum of its proper divisors (6783361050481).
10423213321311 is a wasteful number, since it uses less digits than its factorization.
10423213321311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165447830510 (or 165447830507 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 10423213321311 its reverse (11312331232401), we get a palindrome (21735544553712).
The spelling of 10423213321311 in words is "ten trillion, four hundred twenty-three billion, two hundred thirteen million, three hundred twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •