Base | Representation |
---|---|
bin | 10011011011101101… |
… | …11011011011101110 |
3 | 222221002121212112020 |
4 | 21231312323123232 |
5 | 132331330102400 |
6 | 4443132251010 |
7 | 516353315262 |
oct | 115566733356 |
9 | 28832555466 |
10 | 10433050350 |
11 | 4474204168 |
12 | 2032010a66 |
13 | ca3631298 |
14 | 70d88c0a2 |
15 | 410dee2a0 |
hex | 26ddbb6ee |
10433050350 has 48 divisors (see below), whose sum is σ = 26038825968. Its totient is φ = 2764419840.
The previous prime is 10433050339. The next prime is 10433050351. The reversal of 10433050350 is 5305033401.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 10433050350.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10433050351) 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 23 ways as a sum of consecutive naturals, for example, 197959 + ... + 245058.
It is an arithmetic number, because the mean of its divisors is an integer number (542475541).
Almost surely, 210433050350 is an apocalyptic number.
10433050350 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10433050350 is an abundant number, since it is smaller than the sum of its proper divisors (15605775618).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10433050350 is a wasteful number, since it uses less digits than its factorization.
10433050350 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 443189 (or 443184 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 24.
Adding to 10433050350 its reverse (5305033401), we get a palindrome (15738083751).
The spelling of 10433050350 in words is "ten billion, four hundred thirty-three million, fifty thousand, three hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •