Base | Representation |
---|---|
bin | 1010011101110100111111… |
… | …10001011111010011000001 |
3 | 10000111020000221212201121101 |
4 | 11032322133301133103001 |
5 | 11004034424010310221 |
6 | 120540555323254401 |
7 | 4563534004265545 |
oct | 516723761372301 |
9 | 100436027781541 |
10 | 23015115322561 |
11 | 737372366232a |
12 | 26b859767a401 |
13 | cac41550988b |
14 | 597d1a7d7a25 |
15 | 29da215bdd91 |
hex | 14ee9fc5f4c1 |
23015115322561 has 32 divisors (see below), whose sum is σ = 24074160849536. Its totient is φ = 21980621376000.
The previous prime is 23015115322543. The next prime is 23015115322609. The reversal of 23015115322561 is 16522351151032.
It is not a de Polignac number, because 23015115322561 - 29 = 23015115322049 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 23015115322561.
It is not an unprimeable number, because it can be changed into a prime (23015115322261) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5182415101 + ... + 5182419541.
It is an arithmetic number, because the mean of its divisors is an integer number (752317526548).
Almost surely, 223015115322561 is an apocalyptic number.
It is an amenable number.
23015115322561 is a deficient number, since it is larger than the sum of its proper divisors (1059045526975).
23015115322561 is a wasteful number, since it uses less digits than its factorization.
23015115322561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8753.
The product of its (nonzero) digits is 54000, while the sum is 37.
Adding to 23015115322561 its reverse (16522351151032), we get a palindrome (39537466473593).
The spelling of 23015115322561 in words is "twenty-three trillion, fifteen billion, one hundred fifteen million, three hundred twenty-two thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •