Base | Representation |
---|---|
bin | 1010100001111000100001… |
… | …10001010011110100001100 |
3 | 10000222112200102202111000111 |
4 | 11100330100301103310030 |
5 | 11013330303203220122 |
6 | 121125001342205404 |
7 | 4606565600050555 |
oct | 520742061236414 |
9 | 100875612674014 |
10 | 23154450054412 |
11 | 7417824469686 |
12 | 271b5a2583864 |
13 | cbc5bc300181 |
14 | 5a097792d32c |
15 | 2a2478bcdd77 |
hex | 150f10c53d0c |
23154450054412 has 24 divisors (see below), whose sum is σ = 41140344091392. Its totient is φ = 11400963037200.
The previous prime is 23154450054353. The next prime is 23154450054419. The reversal of 23154450054412 is 21445005445132.
It is a super-3 number, since 3×231544500544123 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (23154450054419) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 112022664 + ... + 112229167.
It is an arithmetic number, because the mean of its divisors is an integer number (1714181003808).
Almost surely, 223154450054412 is an apocalyptic number.
It is an amenable number.
23154450054412 is a deficient number, since it is larger than the sum of its proper divisors (17985894036980).
23154450054412 is a wasteful number, since it uses less digits than its factorization.
23154450054412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 224252229 (or 224252227 counting only the distinct ones).
The product of its (nonzero) digits is 384000, while the sum is 40.
Adding to 23154450054412 its reverse (21445005445132), we get a palindrome (44599455499544).
The spelling of 23154450054412 in words is "twenty-three trillion, one hundred fifty-four billion, four hundred fifty million, fifty-four thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •