Base | Representation |
---|---|
bin | 11101011100000101111… |
… | …111001011011001000110 |
3 | 21011101210102221022111012 |
4 | 131130011333023121012 |
5 | 231121131142403410 |
6 | 4145211150442222 |
7 | 266105366436116 |
oct | 35340577133106 |
9 | 7141712838435 |
10 | 2023030044230 |
11 | 70aa647a0998 |
12 | 2880b0803372 |
13 | 118a03912690 |
14 | 6dcb535d046 |
15 | 37954c74605 |
hex | 1d705fcb646 |
2023030044230 has 64 divisors (see below), whose sum is σ = 4096090736640. Its totient is φ = 713785961856.
The previous prime is 2023030044223. The next prime is 2023030044239. The reversal of 2023030044230 is 324400303202.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a junction number, because it is equal to n+sod(n) for n = 2023030044196 and 2023030044205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2023030044239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2714819 + ... + 3378801.
It is an arithmetic number, because the mean of its divisors is an integer number (64001417760).
Almost surely, 22023030044230 is an apocalyptic number.
2023030044230 is an abundant number, since it is smaller than the sum of its proper divisors (2073060692410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2023030044230 is a wasteful number, since it uses less digits than its factorization.
2023030044230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 665045.
The product of its (nonzero) digits is 3456, while the sum is 23.
Adding to 2023030044230 its reverse (324400303202), we get a palindrome (2347430347432).
The spelling of 2023030044230 in words is "two trillion, twenty-three billion, thirty million, forty-four thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •