Base | Representation |
---|---|
bin | 1011101001111010100… |
… | …1011000010101100100 |
3 | 201010211101100011210112 |
4 | 2322132221120111210 |
5 | 11240032404041312 |
6 | 231552350512152 |
7 | 20315614064552 |
oct | 2723651302544 |
9 | 633741304715 |
10 | 200230143332 |
11 | 77a0a7722aa |
12 | 32980805658 |
13 | 15b5cbcb76b |
14 | 99968acbd2 |
15 | 531d784d22 |
hex | 2e9ea58564 |
200230143332 has 12 divisors (see below), whose sum is σ = 351946376880. Its totient is φ = 99674035656.
The previous prime is 200230143317. The next prime is 200230143391. The reversal of 200230143332 is 233341032002.
200230143332 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2002301433322 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200230143298 and 200230143307.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 110257982 + ... + 110259797.
It is an arithmetic number, because the mean of its divisors is an integer number (29328864740).
Almost surely, 2200230143332 is an apocalyptic number.
It is an amenable number.
200230143332 is a deficient number, since it is larger than the sum of its proper divisors (151716233548).
200230143332 is a wasteful number, since it uses less digits than its factorization.
200230143332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220518010 (or 220518008 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 200230143332 its reverse (233341032002), we get a palindrome (433571175334).
The spelling of 200230143332 in words is "two hundred billion, two hundred thirty million, one hundred forty-three thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •